Matrix Rounding and Related Problems with Application to Digital Halftoning
نویسنده
چکیده
In this paper, we first study the problem of rounding a real-valued matrix into an integer-valued matrix to minimize an Lp-discrepancy measure between them. To define the Lp-discrepancy measure, we introduce a family F of regions (rigid submatrices) of the matrix, and consider a hypergraph defined by the family. The difficulty of the problem depends on the choice of the region family F. We first investigate the rounding problem by using integer programming problems with convex piecewise-linear objective functions. Then, we propose "laminar family" for constructing a practical and well-solvable class of F. Indeed, we show that the problem is solvable in polynomial time if F is the union of two laminar families. We shall present experimental results. We also give some nontrivial upper bounds for the L,-discrepancy. We then foucs on the number of global roundings defined on a hypergraph HG = (V, P G ) which corresponds to a set of shortest paths for a weighted graph G = (V, E). For a given real assignment a on V satisfying 0 I: a(v) 5 1, a global rounding cu with respect to HG is a binary assignment satisfying that I xu,, a(v) cu(v)l < 1 for every F E PG. We conjecture that there are a t most (VI + 1 global roundings for HG.
منابع مشابه
How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy
Motivated by a digital halftoning application to convert a continuous-tone image into a binary image, we discusses how to round a [0; 1]-valued matrix into a f0; 1g binary matrix achieving low discrepancy with respect to the family of all 2 2 square submatrices (or regions). A trivial upper bound of the discrepancy is 2 and the known lower bound is 1. In this paper we shall show how to achieve ...
متن کاملA mathematical description of the dot diffusion algorithm in image halftoning with application in inverse halftoning
The dot diffusion method for digital halftoning has the advantage of parallelism unlike the error diffusion method. The method was recently improved by optimization of the so-called class matrix so that the resulting halftones are comparable to the error diffused halftones. In this paper, we will give a mathematical description of the dot diffusion method. This description is then applied in in...
متن کاملComputational Geometric and Combinatorial Approaches to Digital Halftoning
Digital halftoning is a technique to convert a continuous-tone image into a binary image consisting of black and white dots. It is an important technique for printing machines and printers to output an image with few intensity levels or colors which looks similar to an input image. In this talk I will explain how computational geometry and combinatorial optimization can contribute to digital ha...
متن کاملBackward Diffusion Methods for Digital Halftoning
We examine using discrete backward diffusion to produce digital halftones. The noise introduced by the discrete approximation to backwards diffusion forces the intensity away from uniform values, so that rounding each pixel to black or white can produce a pleasing halftone. We formulate our method by considering the Human Visual System norm and approximating the inverse of the blurring operator...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003